منابع مشابه
Idealized Piecewise Linear Branch Prediction
Traditional branch predictors exploit correlations between pattern history and branch outcome to predict branches, but there is a stronger and more natural correlation between path history and branch outcome. I exploit this correlation with piecewise linear branch prediction, an idealized branch predictor that develops a set of linear functions, one for each program path to the branch to be pre...
متن کاملVariable Length Path Branch Prediction Variable Length Path Branch Prediction
all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for proot or commercial advantage and that copies bear this notice and the full citation on the rst page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, ...
متن کاملConstructing Piecewise Linear
Let P = fp1; : : : ; png and Q = fq1; : : : ; qng be two point sets lying in the interior of rectangles in the plane. We show how to construct a piecewise linear homeomorphism of size O(n2) between the rectangles which maps pi to qi for each i. This bound is optimal in the worst case; i.e., there exist point sets for which any piecewise linear homeomorphism has size (n2). Introduction A homeomo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGARCH Computer Architecture News
سال: 2005
ISSN: 0163-5964
DOI: 10.1145/1080695.1070002